Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square Graphs

In a connected graph , the distance function between each pair of two vertices from set vertex is shortest them and degree denoted by number edges which are incident to The Schultz modified polynomials have defined as: respectively, where summations taken over all unordered pairs distinct in general forms shall be found indices edge – identification chain ring square graphs present work.